ar X iv : c s / 03 10 04 6 v 2 [ cs . C C ] 1 4 Ju n 20 04 Theory of One Tape Linear Time Turing Machines ∗
نویسندگان
چکیده
A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart since one-tape linear-time Turing machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in linear time, where the running time of a machine is defined as the height of its computation tree. We clarify how the machine types affect the computational patterns of one-tape linear-time Turing machines.
منابع مشابه
ar X iv : c s / 03 10 04 6 v 1 [ cs . C C ] 2 3 O ct 2 00 3 Theory of One Tape Linear Time Turing Machines ( Extended
A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart. This paper discusses the computational complexity of one-tape Turing machines of various machine types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in time O(n), where the running time of a machine is defined as t...
متن کاملar X iv : c s / 01 10 03 8 v 1 [ cs . C C ] 1 8 O ct 2 00 1 Counting Is Easy †
For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters in real time.
متن کاملar X iv : c s / 04 04 02 1 v 3 [ cs . C C ] 1 3 Se p 20 04 Computational Universality in Symbolic Dynamical Systems ⋆
Many different definitions of computational universality for various types of systems have flourished since Turing’s work. In this paper, we propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. For Turing machines and tag systems, our definition coincides with the usual notion of universality. It however yields a new definition for cel...
متن کاملar X iv : c s / 04 04 02 1 v 2 [ cs . C C ] 9 A pr 2 00 4 Computational Universality in Symbolic Dynamical Systems ⋆
Many different definitions of computational universality for various types of systems have flourished since Turing’s work. In this paper, we propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. For Turing machines and tag systems, our definition coincides with the usual notion of universality. It however yields a new definition for cel...
متن کاملar X iv : c s / 04 04 02 1 v 1 [ cs . C C ] 8 A pr 2 00 4 Computational Universality in Symbolic Dynamical Systems ⋆
Many different definitions of computational universality for various types of systems have flourished since Turing’s work. In this paper, we propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. For Turing machines and tag systems, our definition coincides with the usual notion of universality. It however yields a new definition for cel...
متن کامل